Complete Path Planning for Planar Closed Chains Among Point Obstacles
نویسندگان
چکیده
A method to compute an exact cell decomposition and corresponding connectivity graph of the configuration space (C-space) of a planar closed chain manipulator moving among point obstacles is developed. By studying the global properties of the loop closure and collision constraint set, a cylindrical decomposition of the collision-free portion of C-space (C-free) is obtained without translating the constraints into polynomials as required by Collins’ method [1]. Once the graph is constructed, motion planning proceeds in the usual way; graph search followed by path construction. Experimental results demonstrate the effectiveness of the algorithm.
منابع مشابه
Toward Complete Path Planning for Planar 3R-Manipulators Among Point Obstacles
The problem of planning a collision-free motions of a planar 3R-manipulator among point obstacles is studied using techniques from topology and homology. By completely characterizing the set of singular configurations (the points in configuration space corresponding to an intersection of the chain with itself or a point obstacle), the complementary space, the free space, is also completely char...
متن کاملPath Planning among Movable Obstacles: A Probabilistically Complete Approach
In this paper we study the problem of path planning among movable obstacles, in which a robot is allowed to move the obstacles if they block the robot’s way from a start to a goal position. We make the observation that we can decouple the computations of the robot motions and the obstacle movements, and present a probabilistically complete algorithm, something which to date has not been achieve...
متن کاملReal-time path planning using harmonic potentials in dynamic environments
Motivated by fluid analogies, artificial harmonic potentials can eliminate local m in ima problems in robot path planning. I n this paper, simple analytical solut ions t o planar harmonic potentials are derived using tools f r o m fluid mechanics, and are applied t o two-dimensional planning among multiple moving obstacles. These closed-form solutions enable real-time computation to be readily ...
متن کاملDeterministic Path Planning for Planar Assemblies
I present a deterministic path planning algorithm for an assembly of rigid planar parts connected by joints. The part boundaries are comprised of line segments and circular arcs. The algorithm is based on configuration space computation and search. It is complete for one moving part and is heuristic for multiple parts. It is the first complete algorithm that is practical for real-world applicat...
متن کاملComplete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configuration space of such systems is a real algebraic variety whose structure is fully determined using techniques from algebraic geometry and differential topology. This structure is then exploited to design a complete pat...
متن کامل